Geometric Random Walks: A Survey∗
نویسنده
چکیده
The developing theory of geometric random walks is outlined here. Three aspects — general methods for estimating convergence (the “mixing” rate), isoperimetric inequalities in Rn and their intimate connection to random walks, and algorithms for fundamental problems (volume computation and convex optimization) that are based on sampling by random walks — are discussed.
منابع مشابه
On Finite Geometric Random Walks and Probabilistic Combinatorics
In this paper we deene and analyze convergence of the geometric random walks. We show that the behavior of such walks is given by certain random matroid processes. In particular, the mixing time is given by the expected stopping time, and the cutoo is equivalent to a phase transition. We also discuss some random geometric random walks as well as some examples and symmetric cases.
متن کاملHalting in Random Walk Kernels
Random walk kernels measure graph similarity by counting matching walks in two graphs. In their most popular form of geometric random walk kernels, longer walks of length k are downweighted by a factor of λ (λ < 1) to ensure convergence of the corresponding geometric series. We know from the field of link prediction that this downweighting often leads to a phenomenon referred to as halting: Lon...
متن کاملOn mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes
In this paper we define and analyze convergence of the geometric random walks, which are certain random walks on vector spaces over finite fields. We show that the behavior of such walks is given by certain random matroid processes. In particular, the mixing time is given by the expected stopping time, and the cutoff is equivalent to sharp threshold. We also discuss some random geometric random...
متن کاملInvariant measures and error bounds for random walks in the quarter-plane based on sums of geometric terms
We consider homogeneous random walks in the quarter-plane. The necessary conditions which characterize random walks of which the invariant measure is a sum of geometric terms are provided in Chen et al. (arXiv:1304.3316, 2013, Probab Eng Informational Sci 29(02):233–251, 2015). Based on these results, we first develop an algorithm to check whether the invariant measure of a given random walk is...
متن کاملMixing of Finite Geometric Random Walks and the Cutoff Phenomenon
In this paper we define and analyze convergence of the geometric random walks. We show that the behavior of such walks is given by certain random matroid processes. In particular, the mixing time is given by the expected stopping time, and the cutoff is equivalent to a threshold phenomenon. In this extended abstract most proofs are omitted. A full version of the paper is available here: http://...
متن کامل